A fundamental set of structure-factor inequalities
نویسندگان
چکیده
منابع مشابه
A set of inequalities in factor analysis.
where y = [yl y~ " ' " y~]' has covariance mat r ix r and is uncorre la ted wi th z = [zl z2 . z~]' which has covar iance mat r ix A, so t h a t z¢ is uncorre la ted wi th zi , 1 < i _~ j < p. T h e variable y~ is called the common-fac tor c o m p o n e n t of x~ and var(y~) -1 -~ is the communa l i ty of x¢ while z~ is the specific fac tor of x~ and var(z~) = ~ is the uniqueness of x¢ . Le t p...
متن کاملCytotoxic and Antioxidant Activity of a Set of Hetero Bicylic Methylthiadiazole Hydrazones: A Structure-Activity Study
The current study highlights the in vitro antioxidant and antitumor activity of the previously-synthesized hydrazone derivatives against various free radicals and human cancer cell lines, respectively. The anticancer efficacies of the compound were tested by measuring cytotoxicity in cancer cell lines HeLa, A549, and non-cancerous NL20 cells. Compounds possessing electron-donor methoxy and me...
متن کاملA complete set of multidimensional Bell inequalities
We give a multidimensional generalisation of the complete set of Bell-correlation inequalities given by Werner and Wolf in [31], and by Ẑukowski and Brukner in [32], for the two-dimensional case. Our construction applies for the n parties, two-observables case, where each observable is d-valued. The d n inequalities obtained involve homogeneous polynomials. They define the facets of a polytope ...
متن کاملVlsi Algorithms for Finding a Fundamental Set of Cycles and a Fundamental Set of Cutsets of a Graph
We present VLSI algorithms that run in O(n 2) steps for nding (and reporting) a fundamental set of cycles and a fundamental set of cutsets of an undirected graph on an nxn mesh of processors (SIMD). Both algorithms are decomposable and run in O(n 4 =k 2) steps for a graph with n vertices when the size of the mesh-connected computer is kxk and k < n. An idea similar to the one used in nding a fu...
متن کاملTwo Game-Set Inequalities
Two players compete in a contest where the first player to win a specified number of points wins the game, and the first player to win a specified number of games wins the set. This paper proves two generalized inequalities, each independent of the probability of winning a point, concerning the better player’s chances of winning. Counterexamples are given for two additional conjectured inequali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica
سال: 1954
ISSN: 0365-110X
DOI: 10.1107/s0365110x5400093x